|
|
Is There Something Beyond AI? Frequently Emerging, but Seldom Answered Questions about Artificial Super-Intelligence
Wiedermann, Jiří
Using the contemporary theories and views of computing and of cognitive systems we indicate possible answers to the following frequently asked questions about artificial intelligence: (i) what is the "computational power" of artificial cognitive systems?; (ii) are there "levels" of intelligence?; (iii) what is the position of human intelligence w.r.t. the "levels" of intelligence?; (iv) is there a general mechanism of intelligence?; (v) can "fully-fledged" body-less intelligence exist?; (vi) can there exist a sentient cloud? We give qualified arguments suggesting that within the large class of computational models of cognitive systems the answers to the previous question are positive. These arguments are mostly based on the author's recent works related to this problematics.
|
|
| |
|
|
Mohou kognitivní a inteligentní systémy překonat Turingovy stroje?
Wiedermann, Jiří
We look for computational limits of artificial, natural and hybrid cognitive and intelligent systems. The common basis for such studies is offered by computationalism, i.e., the belief that cognitive or intelligent processes, respectively, are in essence computational processes. We show that in principle cognitive systems might exist whose computational power outperforms that of Turing machines and that even in practice we observe the rudiments of such systems.
|
|
|
Computational Limits of Cognitive Systems
Wiedermann, Jiří
We describe the quest for the computational limits of cognitive systems. We consider biological, artificial, and hybrid systems which are a combination of the former two systems. The common platform for our studies presents computationalism, i.e. the belief that the cognitive processes can essentially be seen as computational processes.
|
|
|
Super-Turing Computational Potential of Cognitive and Evolutionary Systems
Wiedermann, Jiří
The computational potential of artificial living systems is investigated. Each organism is modelled by so-called cognitive automaton. It is any finite state device with a finite configuration space that processes infinite streams of input symbols. Examples of such automata are finite state automata, discrete neural networks, Boolean circuits, etc. It is shown that non-uniform families of cognitive automata and community of cognitive automata possess a super-Turing computing potential.
|
|
| |
guest ::
